منابع مشابه
Solving fully fuzzy Linear Programming Problem using Breaking Points
Abstract In this paper we have investigated a fuzzy linear programming problem with fuzzy quantities which are LR triangular fuzzy numbers. The given linear programming problem is rearranged according to the satisfactory level of constraints using breaking point method. By considering the constraints, the arranged problem has been investigated for all optimal solutions connected with satisf...
متن کاملBreaking Points in Quartic Maps
Dynamical systems, whether continuous or discrete, are used by physicists in order to study non-linear phenomena. In the case of discrete dynamical systems, one of the most used is the quadratic map depending on a parameter. However, some phenomena can depend alternatively of two values of the same parameter. We use the quadratic map xn+1 = 1 − axn when the parameter alternates between two valu...
متن کاملSymmetry breaking in linearly coupled dynamical lattices.
We examine one- and two-dimensional models of linearly coupled lattices of the discrete-nonlinear-Schrödinger type. Analyzing ground states of the system with equal powers (norms) in the two components, we find a symmetry-breaking phenomenon beyond a critical value of the total power. Asymmetric states, with unequal powers in their components, emerge through a subcritical pitchfork bifurcation,...
متن کاملRandom Points, Convex Bodies, Lattices
Assume K is a convex body in R, and X is a (large) finite subset of K. How many convex polytopes are there whose vertices come from X? What is the typical shape of such a polytope? How well the largest such polytope (which is actually convX) approximates K? We are interested in these questions mainly in two cases. The first is when X is a random sample of n uniform, independent points from K an...
متن کاملFinding fixed points in finite lattices
Recently there has been much interest in the abstract interpretation of declarative languages. Abstract interpretation is a semantics-based approach to program analysis that uses compile time evaluation of programs using simplified value domains. This gives information about the run-time properties of programs and provides the basis for significant performance improvements. A particular example...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Comptes Rendus Mathematique
سال: 2018
ISSN: 1631-073X
DOI: 10.1016/j.crma.2018.06.006